package com.zang.array;

/**
 * @Author: ZVerify
 * @Description: https://leetcode.cn/problems/search-insert-position/
 * @DateTime: 2022/10/2 11:05
 **/
public class 搜索插入位置 {
    // 简单二分
    public int searchInsert(int[] nums, int target) {

        int left = 0;
        int right = nums.length-1;
        
        while (left<=right){
            int mid = left+(left-right)/2;
            if (target>nums[mid]){
                left = mid+1;
            } else if (target<nums[mid]) {
                right = mid-1;
            }else {
                return mid;
            }
        }
        return left;
    }
}
